Parallel random-access machine

Results: 30



#Item
11More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. Michael T. Goodrich, Joseph A. Simons Department of Computer Science, Univers

More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. Michael T. Goodrich, Joseph A. Simons Department of Computer Science, Univers

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2012-10-23 15:28:26
12Finding Hamiltonian Paths in Tournaments on Clusters - A Provably Communication-Efficient Approach Chun-Hsi Huang Xin He

Finding Hamiltonian Paths in Tournaments on Clusters - A Provably Communication-Efficient Approach Chun-Hsi Huang Xin He

Add to Reading List

Source URL: www.cse.uconn.edu

Language: English - Date: 2004-02-16 16:47:53
13Computation-Trace Indistinguishability Obfuscation and its Applications Yu-Chi Chen∗ Sherman S. M. Chow† Wei-Kai Lin¶

Computation-Trace Indistinguishability Obfuscation and its Applications Yu-Chi Chen∗ Sherman S. M. Chow† Wei-Kai Lin¶

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-29 11:40:02
14Characterising Effective Resource Analyses for Parallel and Distributed Coordination P. W. Trinder1 , M. I. Cole2 , H-W. Loidl1 , and G. J. Michaelson1 1  School of Mathematical and Computer Sciences,

Characterising Effective Resource Analyses for Parallel and Distributed Coordination P. W. Trinder1 , M. I. Cole2 , H-W. Loidl1 , and G. J. Michaelson1 1 School of Mathematical and Computer Sciences,

Add to Reading List

Source URL: www.macs.hw.ac.uk

Language: English - Date: 2010-04-06 09:34:25
15Parallel Processing Letters cfWorld Scientific Publishing Company FAILURE-SENSITIVE ANALYSIS OF PARALLEL ALGORITHMS WITH CONTROLLED MEMORY ACCESS CONCURRENCY∗ CHRYSSIS GEORGIOU

Parallel Processing Letters cfWorld Scientific Publishing Company FAILURE-SENSITIVE ANALYSIS OF PARALLEL ALGORITHMS WITH CONTROLLED MEMORY ACCESS CONCURRENCY∗ CHRYSSIS GEORGIOU

Add to Reading List

Source URL: www.cs.ucy.ac.cy

Language: English - Date: 2007-11-27 05:21:39
16Computing Techniques for Parallel and Distributed Systems with an Application to Data Compression Sergio De Agostino Sapienza University di Rome

Computing Techniques for Parallel and Distributed Systems with an Application to Data Compression Sergio De Agostino Sapienza University di Rome

Add to Reading List

Source URL: www.iaria.org

Language: English - Date: 2014-09-22 21:32:00
17The success of the von Neumann model of sequential computation is attributable to the fact that it is an efficient bridge between software and hardware: high-level languages can be efficiently

The success of the von Neumann model of sequential computation is attributable to the fact that it is an efficient bridge between software and hardware: high-level languages can be efficiently

Add to Reading List

Source URL: web.mit.edu

Language: English - Date: 2006-02-28 14:59:14
18SystemVerilog 3.1a Language Reference Manual

SystemVerilog 3.1a Language Reference Manual

Add to Reading List

Source URL: www.eda.org

Language: English - Date: 2004-05-13 18:43:42
19Oblivious Parallel RAM Elette Boyle∗ Technion Israel [removed]  Kai-Min Chung

Oblivious Parallel RAM Elette Boyle∗ Technion Israel [removed] Kai-Min Chung

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-08-02 12:06:39
20Fragile Families Contract Data Agreement  May 2009 Guide to Accessing the Fragile Families Contract Data Description of the Fragile Families and Child Wellbeing Study

Fragile Families Contract Data Agreement May 2009 Guide to Accessing the Fragile Families Contract Data Description of the Fragile Families and Child Wellbeing Study

Add to Reading List

Source URL: www.fragilefamilies.princeton.edu

Language: English - Date: 2013-12-13 14:37:08